Computing coproducts of finitely presented Gödel algebras
نویسندگان
چکیده
منابع مشابه
Finitely Presented Heyting Algebras
In this paper we study the structure of finitely presented Heyting algebras. Using algebraic techniques (as opposed to techniques from proof-theory) we show that every such Heyting algebra is in fact coHeyting, improving on a result of Ghilardi who showed that Heyting algebras free on a finite set of generators are co-Heyting. Along the way we give a new and simple proof of the finite model pro...
متن کاملConstructing Irreducible Representations of Finitely Presented Algebras
We describe an algorithmic test, using the “standard polynomial identity” (and elementary computational commutative algebra), for determining whether or not a finitely presented associative algebra has an irreducible n-dimensional representation. When ndimensional irreducible representations do exist, our proposed procedure can (in principle) produce explicit constructions.
متن کاملSome non-finitely presented Lie Algebras
Let L be a free Lie algebra over a field k, I a non-trivial proper ideal of L, n > 1 an integer. The multiplicator H2(L/I , k) of L/I is not finitely generated, and so in particular, L/I is not finitely presented, even when L/I is finite dimensional.
متن کاملCanonical Forms in Finitely Presented Algebras
canonical forms in finitely presented algebras. Book lovers, when you need a new book to read, find the book here. Never worry not to find what you need. Is the canonical forms in finitely presented algebras your needed book now? That's true; you are really a good reader. This is a perfect book that comes from great author to share with you. The book offers the best experience and lesson to tak...
متن کاملRecursive formulas to compute coproducts of finite Gödel algebras and related structures
Gödel logic and its algebraic semantics, namely, the variety of Gödel algebras, play a major rôle in mathematical fuzzy logic. The category of finite Gödel algebras and their homomorphisms is dually equivalent to the category FF of finite forests and order-preserving open maps. The combinatorial nature of FF allows to reduce the usually difficult problem of computing coproducts of algebras and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2006
ISSN: 0168-0072
DOI: 10.1016/j.apal.2005.12.015